Strategies for Consistency Checking Based on Unification
نویسندگان
چکیده
There is increasing interest in models of system development which use hfulriplc V'ic~lvp~u~t.~. Each viewpoint offers a different perspective on the target system and system devclopmcnt involves parallel refinement of the multiple views. Multiple viewpoints though, prompt the ISWC of consistency between viewpoints. This paper describes an interpretation of consistency which is general enough to meet the requirements of consistency for very general viewpoints models. Furthermore, the paper investigates strategies for checking this consistency definition. Particular emphasis is placed on mechanisms to obtain global consistency (between an arbitrary number ot viewpoints) from a series of binary consistency checks. The consistency checking strategies bc develop are illustrated using the formal description technique LOTOS. 13 1999 Elsevicr Sclcncc B.V. All rights reserved.
منابع مشابه
The Quick Check Pre-unification Filter for Typed Grammars: Extensions
The so called quick check (henceforth QC) preunification filter for feature structure (FS) unification was introduced by (Kiefer et al., 1999). QC is considered the most important speed-up technique in the framework of non-compiled FS unification. We present two potential ways in which the design of the quick check can be further extended: consistency sort check on coreferenced paths, and preun...
متن کاملA type system for embedded rewriting languages with associative pattern matching : from theory to practice
Programmers are often interested in a way to write error-free programs, i.e. to avoid undesired behaviors. In this context, a type system was conceived as the formal method for specification and proof of programs written in the Tom rewriting language. The Tom programming language is an extension of Java that adds pattern matching, more particularly associative pattern matching, and reduction st...
متن کاملUnification of the a priori inconsistencies checking among assembly constraints in assembly sequence planning
Sequence planning generation is an important problem in assembly line design. A good assembly sequence can help to reduce the cost and time of the manufacturing process. This paper focuses on assembly sequence planning (ASP) known as a hard combinatorial optimization problem. Although the ASP problem has been tackled via even more sophisticated optimization techniques, these techniques are ofte...
متن کاملType checking through unification
In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to check definitional equality of terms while type checking gives rise to a tight interplay between type checking and unification. This interplay is a major source ...
متن کاملIUPC: Identification and Unification of Process Constraints
Business Process Compliance (BPC) has gained significant momentum in research and practice during the last years. Although many approaches address BPC, they mostly assume the existence of some kind of unified base of process constraints and focus on their verification over the business processes. However, it remains unclear how such an integrated process constraint base can be built up, even th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 33 شماره
صفحات -
تاریخ انتشار 1999